package com.zx._12_算法.剑指offer._2022;

/**
 * https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/
 */
public class 机器人的运动范围 {

    public int movingCount(int m, int n, int k) {
        // 走过的为true
        boolean[][] res = new boolean[m][n];
        // 4个方向
        int[][] dir = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

        for (int i = 0; i < m; i++) {

        }

        return -1;
    }
}
